منابع مشابه
The Hamiltonian Connected Property of Some Shaped Supergrid Graphs
A Hamiltonian path (cycle) of a graph is a simple path (cycle) which visits each vertex of the graph exactly once. The Hamiltonian path (cycle) problem is to determine whether a graph contains a Hamiltonian path (cycle). A graph is called Hamiltonian connected if there exists a Hamiltonian path between any two distinct vertices. Supergrid graphs were first introduced by us and include grid grap...
متن کاملAn Embedding of Multiple Edge-Disjoint Hamiltonian Cycles on Enhanced Pyramid Graphs
The enhanced pyramid graph was recently proposed as an interconnection network model in parallel processing for maximizing regularity in pyramid networks. We prove that there are two edge-disjoint Hamiltonian cycles in the enhanced pyramid networks. This investigation demonstrates its superior property in edge fault tolerance. This result is optimal in the sense that the minimum degree of the g...
متن کاملThe 3*-connected property of pyramid networks
A k-container C(u, v) of a graph G is a set of k-disjoint paths joining u to v. A k-container C(u, v) of G is a k-container if it contains all the vertices of G. A graph G is k-connected if there exists a k-container between any two distinct vertices in G. Let κ(G) be the connectivity of G. A graph G is superconnected if G is i-connected for all 1 ≤ i ≤ κ(G). The pyramid network is one of the i...
متن کاملHamiltonian Factors in Hamiltonian Graphs
Let G be a Hamiltonian graph. A factor F of G is called a Hamiltonian factor if F contains a Hamiltonian cycle. In this paper, two sufficient conditions are given, which are two neighborhood conditions for a Hamiltonian graph G to have a Hamiltonian factor. Keywords—graph, neighborhood, factor, Hamiltonian factor.
متن کاملA Hamiltonian property for nilpotent algebras
In this paper we show that any finite algebra A satisfying a weak left nilpotence condition has the property that all maximal subuniverses are congruence blocks. Conversely, if every subalgebra of A has the property that all maximal subuniverses are congruence blocks, then A satisfies the aforementioned nilpotence condition.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The KIPS Transactions:PartA
سال: 2006
ISSN: 1598-2831
DOI: 10.3745/kipsta.2006.13a.3.253